Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
Proposal on LATEST-NAME
170 views
Skip to first unread message
Ruvim
Oct 23, 2023, 10:25:00 AM10/23/23
to
I prepared a proposal: New words: latest-name and latest-name-in [1]
In a nutshell:
LATEST-NAME-IN ( wid -- nt|0 )
Remove the word list identifier wid from the stack. If this word list is
empty, then return 0, otherwise return the name token nt for the
definition that was placed most recently into this word list.
LATEST-NAME ( -- nt )
Return the name token nt for the definition that was placed most
recently into the compilation word list, if such definition exists.
Otherwise throw exception code -80.
Feedback is welcome!
[1]
https://forth-standard.org/proposals/new-words-latest-name-and-latest-name-in?hideDiff#reply-1124
--
Ruvim
In a nutshell:
LATEST-NAME-IN ( wid -- nt|0 )
Remove the word list identifier wid from the stack. If this word list is
empty, then return 0, otherwise return the name token nt for the
definition that was placed most recently into this word list.
LATEST-NAME ( -- nt )
Return the name token nt for the definition that was placed most
recently into the compilation word list, if such definition exists.
Otherwise throw exception code -80.
Feedback is welcome!
[1]
https://forth-standard.org/proposals/new-words-latest-name-and-latest-name-in?hideDiff#reply-1124
--
Ruvim
none albert
Oct 23, 2023, 11:04:49 AM10/23/23
to
In article <uh5vno$36el4$1...@dont-email.me>,
since 1993 , working on the transputer Forth with Marcel Hendrix.
There were N fields and N^2 transformation and I have had
enough of it.
I recently wrote a design to lispificate / dynamicate Forth.
In this idea all items are dynamically located.
The first step is to ALLOCATE all name strings,
filling the name fields with a dynamic memory pointer.
The first benefit is that you can replace DROP by a Chinese equivalent
name etc. and have a Chinese friendly Forth.
.....
The process ends with dynamically allocating all the headers
and a total dynamical Forth.
[ Then you can fill in the source field
with a dynamically allocated source string.
You then can edit the source and compile and change the code,
ultimately transforming the Forth from inside itself.
This was the original idea of "computer intelligence Forth"
and I have not really giving up on it. ]
***********************************************************
* Names are SO not determining the identity of a word. *
***********************************************************
I'm not against your proposal, only the names are wrong.
>LATEST ( wid -- dea|0 )
LATEST ( -- dea )
>[1]
>https://forth-standard.org/proposals/new-words-latest-name-and-latest-name-in?hideDiff#reply-1124
>Ruvim
Groetjes Albert
P.S. I use LATEST all over the place. I have a hard time to imagine
a use for >LATEST. Unless ..
Only define >LATEST. LATEST might be controversial so you avoid
standardising it.
On the top of the file you then can say
: LATEST CURRENT @ >LATEST ;
And get it over with.
Same situation as with
: NOT 0= ;
--
Don't praise the day before the evening. One swallow doesn't make spring.
You must not say "hey" before you have crossed the bridge. Don't sell the
hide of the bear until you shot it. Better one bird in the hand than ten in
the air. First gain is a cat spinning. - the Wise from Antrim -
Ruvim <ruvim...@gmail.com> wrote:
>I prepared a proposal: New words: latest-name and latest-name-in [1]
>
>In a nutshell:
>
>LATEST-NAME-IN ( wid -- nt|0 )
>Remove the word list identifier wid from the stack. If this word list is
>empty, then return 0, otherwise return the name token nt for the
>definition that was placed most recently into this word list.
>
>LATEST-NAME ( -- nt )
>Return the name token nt for the definition that was placed most
>recently into the compilation word list, if such definition exists.
>Otherwise throw exception code -80.
>
>Feedback is welcome!
I hate to see NAME here. I advocate dea (dictionary entry address)
>I prepared a proposal: New words: latest-name and latest-name-in [1]
>
>In a nutshell:
>
>LATEST-NAME-IN ( wid -- nt|0 )
>Remove the word list identifier wid from the stack. If this word list is
>empty, then return 0, otherwise return the name token nt for the
>definition that was placed most recently into this word list.
>
>LATEST-NAME ( -- nt )
>Return the name token nt for the definition that was placed most
>recently into the compilation word list, if such definition exists.
>Otherwise throw exception code -80.
>
>Feedback is welcome!
since 1993 , working on the transputer Forth with Marcel Hendrix.
There were N fields and N^2 transformation and I have had
enough of it.
I recently wrote a design to lispificate / dynamicate Forth.
In this idea all items are dynamically located.
The first step is to ALLOCATE all name strings,
filling the name fields with a dynamic memory pointer.
The first benefit is that you can replace DROP by a Chinese equivalent
name etc. and have a Chinese friendly Forth.
.....
The process ends with dynamically allocating all the headers
and a total dynamical Forth.
[ Then you can fill in the source field
with a dynamically allocated source string.
You then can edit the source and compile and change the code,
ultimately transforming the Forth from inside itself.
This was the original idea of "computer intelligence Forth"
and I have not really giving up on it. ]
***********************************************************
* Names are SO not determining the identity of a word. *
***********************************************************
I'm not against your proposal, only the names are wrong.
>LATEST ( wid -- dea|0 )
LATEST ( -- dea )
>[1]
>https://forth-standard.org/proposals/new-words-latest-name-and-latest-name-in?hideDiff#reply-1124
>Ruvim
Groetjes Albert
P.S. I use LATEST all over the place. I have a hard time to imagine
a use for >LATEST. Unless ..
Only define >LATEST. LATEST might be controversial so you avoid
standardising it.
On the top of the file you then can say
: LATEST CURRENT @ >LATEST ;
And get it over with.
Same situation as with
: NOT 0= ;
--
Don't praise the day before the evening. One swallow doesn't make spring.
You must not say "hey" before you have crossed the bridge. Don't sell the
hide of the bear until you shot it. Better one bird in the hand than ten in
the air. First gain is a cat spinning. - the Wise from Antrim -
Ruvim
Oct 23, 2023, 11:37:30 AM10/23/23
to
On 2023-10-23 15:04, albert wrote:
> In article <uh5vno$36el4$1...@dont-email.me>,
> Ruvim <ruvim...@gmail.com> wrote:
>> I prepared a proposal: New words: latest-name and latest-name-in [1]
>>
>> In a nutshell:
>>
>> LATEST-NAME-IN ( wid -- nt|0 )
>> Remove the word list identifier wid from the stack. If this word list is
>> empty, then return 0, otherwise return the name token nt for the
>> definition that was placed most recently into this word list.
>>
>> LATEST-NAME ( -- nt )
>> Return the name token nt for the definition that was placed most
>> recently into the compilation word list, if such definition exists.
>> Otherwise throw exception code -80.
>>
>> Feedback is welcome!
>
> I hate to see NAME here. I advocate dea (dictionary entry address)
> since 1993 , working on the transputer Forth with Marcel Hendrix.
> There were N fields and N^2 transformation and I have had
> enough of it.
"DEA" is an acronym. It's better to use a full English word if appropriate.
> In article <uh5vno$36el4$1...@dont-email.me>,
> Ruvim <ruvim...@gmail.com> wrote:
>> I prepared a proposal: New words: latest-name and latest-name-in [1]
>>
>> In a nutshell:
>>
>> LATEST-NAME-IN ( wid -- nt|0 )
>> Remove the word list identifier wid from the stack. If this word list is
>> empty, then return 0, otherwise return the name token nt for the
>> definition that was placed most recently into this word list.
>>
>> LATEST-NAME ( -- nt )
>> Return the name token nt for the definition that was placed most
>> recently into the compilation word list, if such definition exists.
>> Otherwise throw exception code -80.
>>
>> Feedback is welcome!
>
> I hate to see NAME here. I advocate dea (dictionary entry address)
> since 1993 , working on the transputer Forth with Marcel Hendrix.
> There were N fields and N^2 transformation and I have had
> enough of it.
"NAME" has a long history. It denoted NFA, and now it denotes a name
token, which is successor of NFA — in all words except "PARSE-NAME", for
example "FIND-NAME", "FIND-NAME-IN", "NAME>COMPILE", etc.
There is no point in replacing "NAME" in all these words.
At the same time, naming for new words must be in consistence with
existing words.
[...]
>
> ***********************************************************
> * Names are SO not determining the identity of a word. *
> ***********************************************************
>
> I'm not against your proposal, only the names are wrong.
>
> >LATEST ( wid -- dea|0 )
> LATEST ( -- dea )
The first name is not consistent with other similar names.
> ***********************************************************
> * Names are SO not determining the identity of a word. *
> ***********************************************************
>
> I'm not against your proposal, only the names are wrong.
>
> >LATEST ( wid -- dea|0 )
> LATEST ( -- dea )
And words with the second name already exist in many Forth systems, and
they behavior varies.
>
>> [1]
>> https://forth-standard.org/proposals/new-words-latest-name-and-latest-name-in?hideDiff#reply-1124
>> Ruvim
>
> Groetjes Albert
>
> P.S. I use LATEST all over the place. I have a hard time to imagine
> a use for >LATEST. Unless ..
>
> Only define >LATEST. LATEST might be controversial so you avoid
> standardising it.
> On the top of the file you then can say
> : LATEST CURRENT @ >LATEST ;
In my proposal this word never returns 0, but throws an exception instead.
> And get it over with.
> Same situation as with
> : NOT 0= ;
--
Marcel Hendrix
Oct 23, 2023, 12:44:57 PM10/23/23
to
On Monday, October 23, 2023 at 5:37:30 PM UTC+2, Ruvim wrote:
[..]
Why in heavens name, call it PARSE-NAME ?
PARSE-NAME CORE EXT
( <spaces>name<space> -- c-addr u )
Skip leading space delimiters. Parse name delimited by a space.
c-addr is the address of the selected string within the input buffer
and u is its length in characters. If the parse area is empty or contains
only white space, the resulting string has length zero.
Apart from the above, it makes no sense and is counter-intuitive?
-marcel
[..]
> "NAME" has a long history. It denoted NFA, and now it denotes a name
> token, which is successor of NFA — in all words except
> "PARSE-NAME", for example "FIND-NAME", "FIND-NAME-IN", "NAME>COMPILE", etc.
------------------------
> token, which is successor of NFA — in all words except
> "PARSE-NAME", for example "FIND-NAME", "FIND-NAME-IN", "NAME>COMPILE", etc.
Why in heavens name, call it PARSE-NAME ?
PARSE-NAME CORE EXT
( <spaces>name<space> -- c-addr u )
Skip leading space delimiters. Parse name delimited by a space.
c-addr is the address of the selected string within the input buffer
and u is its length in characters. If the parse area is empty or contains
only white space, the resulting string has length zero.
Apart from the above, it makes no sense and is counter-intuitive?
-marcel
Ruvim
Oct 23, 2023, 1:22:41 PM10/23/23
to
On 2023-10-23 16:44, Marcel Hendrix wrote:
> On Monday, October 23, 2023 at 5:37:30 PM UTC+2, Ruvim wrote:
> [..]
>> "NAME" has a long history. It denoted NFA, and now it denotes a name
>> token, which is successor of NFA — in all words except
>> "PARSE-NAME", for example "FIND-NAME", "FIND-NAME-IN", "NAME>COMPILE", etc.
> ------------------------
>
> Why in heavens name, call it PARSE-NAME ?
Anton wrote [2]: "PARSE-NAME was originally proposed as PARSE-WORD, but
> On Monday, October 23, 2023 at 5:37:30 PM UTC+2, Ruvim wrote:
> [..]
>> "NAME" has a long history. It denoted NFA, and now it denotes a name
>> token, which is successor of NFA — in all words except
>> "PARSE-NAME", for example "FIND-NAME", "FIND-NAME-IN", "NAME>COMPILE", etc.
> ------------------------
>
> Why in heavens name, call it PARSE-NAME ?
that name has conflicting behaviour in some widely-used systems, so
PARSE-NAME was chosen."
In my message at [2], I was wrong that PARSE-NAME did not have conflicts
in 2005. "NAME" was used to denote "NFA" long before that.
So it was a bad choice even in 2005. Another example of a bad name
choice is "BUFFER:", which too close to "BUFFER".
For "BUFFER:" I suggest the synonym "REGION" (as in "a memory region").
Without a colon in the name, since all other similar defining words
don't have a colon in their names.
Instead of "PARSE-NAME" — we can have "PARSE-LEXEME"
>
> PARSE-NAME CORE EXT
> ( <spaces>name<space> -- c-addr u )
> Skip leading space delimiters. Parse name delimited by a space.
> c-addr is the address of the selected string within the input buffer
> and u is its length in characters. If the parse area is empty or contains
> only white space, the resulting string has length zero.
>
> Apart from the above, it makes no sense and is counter-intuitive?
>
> -marcel
--
Ruvim
Anton Ertl
Oct 23, 2023, 1:35:21 PM10/23/23
to
Water down the river. But if you are interested, you can read about
it at <http://www.forth200x.org/parse-name.html>. And there it says:
|Several systems have implemented a PARSE-WORD compatible with this
|specification, e.g., Gforth and Quartus.
|
|However, several systems have implemented words called PARSE-WORD that
|are incompatible with this specification (e.g., MPE's Forths,
|MinForth, CHForth, F83, Jforth, 4th; Mops is also incompatible, but in
|a less problematic way), and Stephen Pelc indicated that MPE's Forth
|would never implement this word with the name PARSE-WORD.
|
|Therefore, a new name is needed for this functionality, and a
|strawpoll indicated the most support for PARSE-NAME.
And looking for the strawpoll, I find in
<2005Apr2...@mips.complang.tuwien.ac.at>:
|Well, in the meantime more people have expressed their opinion:
|
|NextWord (conflict: exists with different meaning in Win32Forth)
|TOKEN
| Supported by: Alex McDonald
| Could live with it: Bernd Paysan
| Strongly opposed: Michael L Gassanenko
|NAME (existing practice: exists with this meaning in Gforth)
| Supported by: Coos Haak
| Supported by: Albert van der Horst
| Could live with it: Bernd Paysan
| (Michael Gassenenko points out that it does not fit with >NAME NAME>)
|EXTRACTWORD
|EXTRACT-WORD
| Supported by: Ward McFarland
|GET-WORD
|GET-NAME
|GET-TOKEN
|PARSE-NAME
| Supported by: Stephen Pelc
| Second choice: Albert van der Horst
| Could live with it: Ward McFarland
| Could also support: Alex McDonald
| Could live with it: Marcel Hendrix
| Can live with it: David N. Williams
| Supported by: Anton Ertl
|PARSE-STREAM
|
|So I have decided to go forward with PARSE-NAME and I will send an RfD
|for it soon.
- anton
--
M. Anton Ertl http://www.complang.tuwien.ac.at/anton/home.html
comp.lang.forth FAQs: http://www.complang.tuwien.ac.at/forth/faq/toc.html
New standard: https://forth-standard.org/
EuroForth 2023: https://euro.theforth.net/2023
it at <http://www.forth200x.org/parse-name.html>. And there it says:
|Several systems have implemented a PARSE-WORD compatible with this
|specification, e.g., Gforth and Quartus.
|
|However, several systems have implemented words called PARSE-WORD that
|are incompatible with this specification (e.g., MPE's Forths,
|MinForth, CHForth, F83, Jforth, 4th; Mops is also incompatible, but in
|a less problematic way), and Stephen Pelc indicated that MPE's Forth
|would never implement this word with the name PARSE-WORD.
|
|Therefore, a new name is needed for this functionality, and a
|strawpoll indicated the most support for PARSE-NAME.
And looking for the strawpoll, I find in
<2005Apr2...@mips.complang.tuwien.ac.at>:
|Well, in the meantime more people have expressed their opinion:
|
|NextWord (conflict: exists with different meaning in Win32Forth)
|TOKEN
| Supported by: Alex McDonald
| Could live with it: Bernd Paysan
| Strongly opposed: Michael L Gassanenko
|NAME (existing practice: exists with this meaning in Gforth)
| Supported by: Coos Haak
| Supported by: Albert van der Horst
| Could live with it: Bernd Paysan
| (Michael Gassenenko points out that it does not fit with >NAME NAME>)
|EXTRACTWORD
|EXTRACT-WORD
| Supported by: Ward McFarland
|GET-WORD
|GET-NAME
|GET-TOKEN
|PARSE-NAME
| Supported by: Stephen Pelc
| Second choice: Albert van der Horst
| Could live with it: Ward McFarland
| Could also support: Alex McDonald
| Could live with it: Marcel Hendrix
| Can live with it: David N. Williams
| Supported by: Anton Ertl
|PARSE-STREAM
|
|So I have decided to go forward with PARSE-NAME and I will send an RfD
|for it soon.
- anton
--
M. Anton Ertl http://www.complang.tuwien.ac.at/anton/home.html
comp.lang.forth FAQs: http://www.complang.tuwien.ac.at/forth/faq/toc.html
New standard: https://forth-standard.org/
EuroForth 2023: https://euro.theforth.net/2023
minforth
Oct 23, 2023, 4:03:53 PM10/23/23
to
Ruvim schrieb am Montag, 23. Oktober 2023 um 16:25:00 UTC+2:
> I prepared a proposal: New words: latest-name and latest-name-in [1]
>
> In a nutshell:
>
> LATEST-NAME-IN ( wid -- nt|0 )
> Remove the word list identifier wid from the stack. If this word list is
> empty, then return 0, otherwise return the name token nt for the
> definition that was placed most recently into this word list.
>
> LATEST-NAME ( -- nt )
> Return the name token nt for the definition that was placed most
> recently into the compilation word list, if such definition exists.
> Otherwise throw exception code -80.
>
> Feedback is welcome!
I fail to see a use case.
> I prepared a proposal: New words: latest-name and latest-name-in [1]
>
> In a nutshell:
>
> LATEST-NAME-IN ( wid -- nt|0 )
> Remove the word list identifier wid from the stack. If this word list is
> empty, then return 0, otherwise return the name token nt for the
> definition that was placed most recently into this word list.
>
> LATEST-NAME ( -- nt )
> Return the name token nt for the definition that was placed most
> recently into the compilation word list, if such definition exists.
> Otherwise throw exception code -80.
>
> Feedback is welcome!
IMO the inner mechanisms of compilers shouldn't be cemented
by so-called standards.
Ruvim
Oct 23, 2023, 4:49:04 PM10/23/23
to
On 2023-10-23 20:03, minforth wrote:
> Ruvim schrieb am Montag, 23. Oktober 2023 um 16:25:00 UTC+2:
>> I prepared a proposal: New words: latest-name and latest-name-in [1]
>>
>> In a nutshell:
>>
>> LATEST-NAME-IN ( wid -- nt|0 )
>> Remove the word list identifier wid from the stack. If this word list is
>> empty, then return 0, otherwise return the name token nt for the
>> definition that was placed most recently into this word list.
>>
>> LATEST-NAME ( -- nt )
>> Return the name token nt for the definition that was placed most
>> recently into the compilation word list, if such definition exists.
>> Otherwise throw exception code -80.
>>
>> Feedback is welcome!
>
> I fail to see a use case.
In the section "Typical use" (by the link), two use case examples are shown.
> Ruvim schrieb am Montag, 23. Oktober 2023 um 16:25:00 UTC+2:
>> I prepared a proposal: New words: latest-name and latest-name-in [1]
>>
>> In a nutshell:
>>
>> LATEST-NAME-IN ( wid -- nt|0 )
>> Remove the word list identifier wid from the stack. If this word list is
>> empty, then return 0, otherwise return the name token nt for the
>> definition that was placed most recently into this word list.
>>
>> LATEST-NAME ( -- nt )
>> Return the name token nt for the definition that was placed most
>> recently into the compilation word list, if such definition exists.
>> Otherwise throw exception code -80.
>>
>> Feedback is welcome!
>
> I fail to see a use case.
Vocabulary for structure definition:
: struct: ( "name" -- wid.current.old u.offset )
vocabulary
get-current
also latest-name name> execute
definitions
0
;
Init a deferred definition:
\ in the application's vocabulary
: it ( -- xt ) latest-name name>interpret ;
defer foo
: bar ... ; it is foo
A decorator example:
: [!] ( "name" -- )
latest-name dup >r
name>string ['] : execute-parsing
r> name> ' execute
postpone ;
;
: make-pretty ( xt -- )
[: ." (I got decorated)" ;] compile, compile,
;
: foo ." (I'm ordinary)" ;
[!] make-pretty
foo \ "(I got decorated)(I'm ordinary)"
> IMO the inner mechanisms of compilers shouldn't be cemented
> by so-called standards.
The only additional burden is to store the latest word in the word list
structure. But anyway, almost all Forth systems do it. If not — the
system is free to not provide this API.
--
Ruvim
dxf
Oct 23, 2023, 11:51:20 PM10/23/23
to
On 24/10/2023 1:24 am, Ruvim wrote:
> I prepared a proposal: New words: latest-name and latest-name-in [1]
>
> In a nutshell:
>
> LATEST-NAME-IN ( wid -- nt|0 )
> Remove the word list identifier wid from the stack. If this word list is empty, then return 0, otherwise return the name token nt for the definition that was placed most recently into this word list.
>
> LATEST-NAME ( -- nt )
> Return the name token nt for the definition that was placed most recently into the compilation word list, if such definition exists. Otherwise throw exception code -80.
>
> Feedback is welcome!
Why the exception on LATEST-NAME - how many forths do that?
> I prepared a proposal: New words: latest-name and latest-name-in [1]
>
> In a nutshell:
>
> LATEST-NAME-IN ( wid -- nt|0 )
> Remove the word list identifier wid from the stack. If this word list is empty, then return 0, otherwise return the name token nt for the definition that was placed most recently into this word list.
>
> LATEST-NAME ( -- nt )
> Return the name token nt for the definition that was placed most recently into the compilation word list, if such definition exists. Otherwise throw exception code -80.
>
> Feedback is welcome!
minforth
Oct 24, 2023, 2:49:26 AM10/24/23
to
Ruvim schrieb am Montag, 23. Oktober 2023 um 22:49:04 UTC+2:
> On 2023-10-23 20:03, minforth wrote:
> > Ruvim schrieb am Montag, 23. Oktober 2023 um 16:25:00 UTC+2:
> >> I prepared a proposal: New words: latest-name and latest-name-in [1]
> >>
> >> In a nutshell:
> >>
> >> LATEST-NAME-IN ( wid -- nt|0 )
> >> Remove the word list identifier wid from the stack. If this word list is
> >> empty, then return 0, otherwise return the name token nt for the
> >> definition that was placed most recently into this word list.
> >>
> >> LATEST-NAME ( -- nt )
> >> Return the name token nt for the definition that was placed most
> >> recently into the compilation word list, if such definition exists.
> >> Otherwise throw exception code -80.
> >>
> >> Feedback is welcome!
> >
> > I fail to see a use case.
> In the section "Typical use" (by the link), two use case examples are shown.
Those are examples for compiler extensions.
> On 2023-10-23 20:03, minforth wrote:
> > Ruvim schrieb am Montag, 23. Oktober 2023 um 16:25:00 UTC+2:
> >> I prepared a proposal: New words: latest-name and latest-name-in [1]
> >>
> >> In a nutshell:
> >>
> >> LATEST-NAME-IN ( wid -- nt|0 )
> >> Remove the word list identifier wid from the stack. If this word list is
> >> empty, then return 0, otherwise return the name token nt for the
> >> definition that was placed most recently into this word list.
> >>
> >> LATEST-NAME ( -- nt )
> >> Return the name token nt for the definition that was placed most
> >> recently into the compilation word list, if such definition exists.
> >> Otherwise throw exception code -80.
> >>
> >> Feedback is welcome!
> >
> > I fail to see a use case.
> In the section "Typical use" (by the link), two use case examples are shown.
> > IMO the inner mechanisms of compilers shouldn't be cemented
> > by so-called standards.
> The proposed API cements exactly zero inner mechanisms of compilers.
> The only additional burden is to store the latest word in the word list
> structure. But anyway, almost all Forth systems do it. If not — the
> system is free to not provide this API.
Also as a good place for recognizers, whenever that proposal makes it.
dxf
Oct 24, 2023, 3:43:27 AM10/24/23
to
none albert
Oct 24, 2023, 3:48:36 AM10/24/23
to
none albert
Oct 24, 2023, 4:37:33 AM10/24/23
to
In article <uh63vl$37cua$1...@dont-email.me>,
There are Forth names that are abbreviations:
R/O R/W SCR TIB SM/REM UM/MOD
In the 30 years I have used DEA nobody has come up that catches the
concept properly, and certainly anybody who has come up with a name that
catches the concept improperly have found that is subject to confusion and
infighting. On the other hand *nobody* has used "dea" in a conflicting
way.
"
The DEA of a word identifies the word internally. It should be
possible for the system to find all the properies of word
knowing its DEA. In particular the executable code and its
name (if it has a name)
" ^^^^^^^^^^^^^^^^
It bears repeating:
***********************************************************
* Names are SO not determining the identity of a word. *
***********************************************************
>
the string NAME is a separate concept of the dea.
Compare :
FOUND ( sc -- dea )
Look up the sc (addr len) in the current search order.
Return *the* address dea, the address that rules them all.
>
>
>[...]
>>
>> ***********************************************************
>> * Names are SO not determining the identity of a word. *
>> ***********************************************************
>>
>> I'm not against your proposal, only the names are wrong.
>>
>> >LATEST ( wid -- dea|0 )
>> LATEST ( -- dea )
>
>The first name is not consistent with other similar names.
>
>And words with the second name already exist in many Forth systems, and
>they behavior varies.
Seriously? What with S>D >R U> EKEY>CHAR
You are trying to win a debate here at any price. That doesnot get you
points in a standard commission that must compromise.
It is not a fraternety debate club.
>>> [1]
>>> https://forth-standard.org/proposals/new-words-latest-name-and-latest-name-in?hideDiff#reply-1124
>>> Ruvim
>>
>> Groetjes Albert
>>
>> P.S. I use LATEST all over the place. I have a hard time to imagine
>> a use for >LATEST. Unless ..
>>
>> Only define >LATEST. LATEST might be controversial so you avoid
>> standardising it.
>> On the top of the file you then can say
>> : LATEST CURRENT @ >LATEST ;
>
>It's will be slightly longer.
>In my proposal this word never returns 0, but throws an exception instead.
>
>> And get it over with.
>> Same situation as with
>> : NOT 0= ;
I can't getting the point accross.
The problem with LATEST that the obvious solution doesn't work.
The naive solution reading iso93 is returning an xt.
So what thingy is LATEST to return?
>--
>Ruvim
>
Groetjes Albert
Ruvim <ruvim...@gmail.com> wrote:
>On 2023-10-23 15:04, albert wrote:
>> In article <uh5vno$36el4$1...@dont-email.me>,
>> Ruvim <ruvim...@gmail.com> wrote:
>>> I prepared a proposal: New words: latest-name and latest-name-in [1]
>>>
>>> In a nutshell:
>>>
>>> LATEST-NAME-IN ( wid -- nt|0 )
>>> Remove the word list identifier wid from the stack. If this word list is
>>> empty, then return 0, otherwise return the name token nt for the
>>> definition that was placed most recently into this word list.
>>>
>>> LATEST-NAME ( -- nt )
>>> Return the name token nt for the definition that was placed most
>>> recently into the compilation word list, if such definition exists.
>>> Otherwise throw exception code -80.
>>>
>>> Feedback is welcome!
>>
>> I hate to see NAME here. I advocate dea (dictionary entry address)
>> since 1993 , working on the transputer Forth with Marcel Hendrix.
>> There were N fields and N^2 transformation and I have had
>> enough of it.
>
>"DEA" is an acronym. It's better to use a full English word if appropriate.
This a slight disadvantage. However it conflicts with nothing.
>On 2023-10-23 15:04, albert wrote:
>> In article <uh5vno$36el4$1...@dont-email.me>,
>> Ruvim <ruvim...@gmail.com> wrote:
>>> I prepared a proposal: New words: latest-name and latest-name-in [1]
>>>
>>> In a nutshell:
>>>
>>> LATEST-NAME-IN ( wid -- nt|0 )
>>> Remove the word list identifier wid from the stack. If this word list is
>>> empty, then return 0, otherwise return the name token nt for the
>>> definition that was placed most recently into this word list.
>>>
>>> LATEST-NAME ( -- nt )
>>> Return the name token nt for the definition that was placed most
>>> recently into the compilation word list, if such definition exists.
>>> Otherwise throw exception code -80.
>>>
>>> Feedback is welcome!
>>
>> I hate to see NAME here. I advocate dea (dictionary entry address)
>> since 1993 , working on the transputer Forth with Marcel Hendrix.
>> There were N fields and N^2 transformation and I have had
>> enough of it.
>
>"DEA" is an acronym. It's better to use a full English word if appropriate.
There are Forth names that are abbreviations:
R/O R/W SCR TIB SM/REM UM/MOD
In the 30 years I have used DEA nobody has come up that catches the
concept properly, and certainly anybody who has come up with a name that
catches the concept improperly have found that is subject to confusion and
infighting. On the other hand *nobody* has used "dea" in a conflicting
way.
"
The DEA of a word identifies the word internally. It should be
possible for the system to find all the properies of word
knowing its DEA. In particular the executable code and its
name (if it has a name)
" ^^^^^^^^^^^^^^^^
It bears repeating:
***********************************************************
* Names are SO not determining the identity of a word. *
***********************************************************
>
>"NAME" has a long history. It denoted NFA, and now it denotes a name
>token, which is successor of NFA — in all words except "PARSE-NAME", for
>example "FIND-NAME", "FIND-NAME-IN", "NAME>COMPILE", etc.
>
>There is no point in replacing "NAME" in all these words.
>At the same time, naming for new words must be in consistence with
>existing words.
That is a non sequitur. In particular FIND-NAME is an example why
>token, which is successor of NFA — in all words except "PARSE-NAME", for
>example "FIND-NAME", "FIND-NAME-IN", "NAME>COMPILE", etc.
>
>There is no point in replacing "NAME" in all these words.
>At the same time, naming for new words must be in consistence with
>existing words.
the string NAME is a separate concept of the dea.
Compare :
FOUND ( sc -- dea )
Look up the sc (addr len) in the current search order.
Return *the* address dea, the address that rules them all.
>
>
>[...]
>>
>> ***********************************************************
>> * Names are SO not determining the identity of a word. *
>> ***********************************************************
>>
>> I'm not against your proposal, only the names are wrong.
>>
>> >LATEST ( wid -- dea|0 )
>> LATEST ( -- dea )
>
>The first name is not consistent with other similar names.
>
>And words with the second name already exist in many Forth systems, and
>they behavior varies.
You are trying to win a debate here at any price. That doesnot get you
points in a standard commission that must compromise.
It is not a fraternety debate club.
>>> [1]
>>> https://forth-standard.org/proposals/new-words-latest-name-and-latest-name-in?hideDiff#reply-1124
>>> Ruvim
>>
>> Groetjes Albert
>>
>> P.S. I use LATEST all over the place. I have a hard time to imagine
>> a use for >LATEST. Unless ..
>>
>> Only define >LATEST. LATEST might be controversial so you avoid
>> standardising it.
>> On the top of the file you then can say
>> : LATEST CURRENT @ >LATEST ;
>
>It's will be slightly longer.
>In my proposal this word never returns 0, but throws an exception instead.
>
>> And get it over with.
>> Same situation as with
>> : NOT 0= ;
The problem with LATEST that the obvious solution doesn't work.
The naive solution reading iso93 is returning an xt.
So what thingy is LATEST to return?
>--
>Ruvim
>
Groetjes Albert
none albert
Oct 24, 2023, 5:16:36 AM10/24/23
to
In article <uh6m7s$3cc1o$1...@dont-email.me>,
Ruvim <ruvim...@gmail.com> wrote:
<SNIP>
WANT decorated {
: foo "(I'm ordinary)" TYPE ;
{ "(I got decorated)" TYPE } 'foo decorated
foo
(I'm ordinary)
The use case of `decorated is to add temporary debug
information to a complicated system, especially if
Heisenbugs prevent you to insert debugging code.
An example of a recent use in a Make Another Lisp project.
{ DUP EMIT CO DUP DUP SIZE TYPE &| EMIT } '$C+a decorated
$C+a appends a character to an ALLOCATEd string
What is after CO (Chuck Moores name is ;: ) is code
that is executed after the word decorated executes.
An example of output would be
AanothernameA|
confirming that the character is properly appended to the
ALLOCATE string, that was formerly apparently "anothername".
You can use the clunky :NONAME for { and ; for }
but the following won't fly.
: doit { "(I got decorated)" TYPE } 'foo decorated ;
doit
Ruvim <ruvim...@gmail.com> wrote:
<SNIP>
>A decorator example:
>
> : [!] ( "name" -- )
> latest-name dup >r
> name>string ['] : execute-parsing
> r> name> ' execute
> postpone ;
> ;
>
>
> : make-pretty ( xt -- )
> [: ." (I got decorated)" ;] compile, compile,
> ;
>
> : foo ." (I'm ordinary)" ;
> [!] make-pretty
>
> foo \ "(I got decorated)(I'm ordinary)"
>
In ciforth (leaving out the OK's)
>
> : [!] ( "name" -- )
> latest-name dup >r
> name>string ['] : execute-parsing
> r> name> ' execute
> postpone ;
> ;
>
>
> : make-pretty ( xt -- )
> [: ." (I got decorated)" ;] compile, compile,
> ;
>
> : foo ." (I'm ordinary)" ;
> [!] make-pretty
>
> foo \ "(I got decorated)(I'm ordinary)"
>
WANT decorated {
: foo "(I'm ordinary)" TYPE ;
{ "(I got decorated)" TYPE } 'foo decorated
foo
(I got decorated)(I'm ordinary)
'foo undecorated
(I got decorated)(I'm ordinary)
foo
(I'm ordinary)
The use case of `decorated is to add temporary debug
information to a complicated system, especially if
Heisenbugs prevent you to insert debugging code.
An example of a recent use in a Make Another Lisp project.
{ DUP EMIT CO DUP DUP SIZE TYPE &| EMIT } '$C+a decorated
$C+a appends a character to an ALLOCATEd string
What is after CO (Chuck Moores name is ;: ) is code
that is executed after the word decorated executes.
An example of output would be
AanothernameA|
confirming that the character is properly appended to the
ALLOCATE string, that was formerly apparently "anothername".
You can use the clunky :NONAME for { and ; for }
but the following won't fly.
: doit { "(I got decorated)" TYPE } 'foo decorated ;
doit
Ruvim
Oct 24, 2023, 7:11:27 AM10/24/23
to
It does not matter how many Forth systems do that, since it's a new
word, and it is intended for users, not for the internal needs of the
system (of course the system may use it, but is not required to do so).
What matters is how many users/programs check the returned value on
zero, and why they do it. As I see, programs almost never check the
returned value from such words. It means, this word shall throw an
exception instead of return 0.
--
Ruvim
Ruvim
Oct 24, 2023, 7:22:06 AM10/24/23
to
On 2023-10-24 09:16, albert wrote:
> In article <uh6m7s$3cc1o$1...@dont-email.me>,
> Ruvim <ruvim...@gmail.com> wrote:
> <SNIP>
>> A decorator example:
>>
>> : [!] ( "name" -- )
>> latest-name dup >r
>> name>string ['] : execute-parsing
>> r> name> ' execute
>> postpone ;
>> ;
>>
>>
>> : make-pretty ( xt -- )
>> [: ." (I got decorated)" ;] compile, compile,
>> ;
>>
>> : foo ." (I'm ordinary)" ;
>> [!] make-pretty
>>
>> foo \ "(I got decorated)(I'm ordinary)"
>>
>
> In ciforth (leaving out the OK's)
>
> WANT decorated {
> : foo "(I'm ordinary)" TYPE ;
> { "(I got decorated)" TYPE } 'foo decorated
The idea of a special syntax for decoration is that you don't need to
> In article <uh6m7s$3cc1o$1...@dont-email.me>,
> Ruvim <ruvim...@gmail.com> wrote:
> <SNIP>
>> A decorator example:
>>
>> : [!] ( "name" -- )
>> latest-name dup >r
>> name>string ['] : execute-parsing
>> r> name> ' execute
>> postpone ;
>> ;
>>
>>
>> : make-pretty ( xt -- )
>> [: ." (I got decorated)" ;] compile, compile,
>> ;
>>
>> : foo ." (I'm ordinary)" ;
>> [!] make-pretty
>>
>> foo \ "(I got decorated)(I'm ordinary)"
>>
>
> In ciforth (leaving out the OK's)
>
> WANT decorated {
> : foo "(I'm ordinary)" TYPE ;
> { "(I got decorated)" TYPE } 'foo decorated
repeat the name of the word that is decorated.
Otherwise it's just a wrapper, which can be always implemented directly.
> foo
> (I got decorated)(I'm ordinary)
> 'foo undecorated
> foo
> (I'm ordinary)
>
> The use case of `decorated is to add temporary debug
> information to a complicated system, especially if
> Heisenbugs prevent you to insert debugging code.
>
> An example of a recent use in a Make Another Lisp project.
> { DUP EMIT CO DUP DUP SIZE TYPE &| EMIT } '$C+a decorated
> $C+a appends a character to an ALLOCATEd string
> What is after CO (Chuck Moores name is ;: ) is code
> that is executed after the word decorated executes.
> An example of output would be
> AanothernameA|
> confirming that the character is properly appended to the
> ALLOCATE string, that was formerly apparently "anothername".
>
> You can use the clunky :NONAME for { and ; for }
> but the following won't fly.
>
> : doit { "(I got decorated)" TYPE } 'foo decorated ;
> doit
But your implementation is too system specific — it requires a
capability to change behavior of any word.
--
Ruvim
Ruvim
Oct 24, 2023, 7:36:11 AM10/24/23
to
On 2023-10-24 06:49, minforth wrote:
> Ruvim schrieb am Montag, 23. Oktober 2023 um 22:49:04 UTC+2:
>> On 2023-10-23 20:03, minforth wrote:
>>> Ruvim schrieb am Montag, 23. Oktober 2023 um 16:25:00 UTC+2:
>>>> I prepared a proposal: New words: latest-name and latest-name-in [1]
>>>>
>>>> In a nutshell:
>>>>
>>>> LATEST-NAME-IN ( wid -- nt|0 )
>>>> Remove the word list identifier wid from the stack. If this word list is
>>>> empty, then return 0, otherwise return the name token nt for the
>>>> definition that was placed most recently into this word list.
>>>>
>>>> LATEST-NAME ( -- nt )
>>>> Return the name token nt for the definition that was placed most
>>>> recently into the compilation word list, if such definition exists.
>>>> Otherwise throw exception code -80.
>>>>
>>>> Feedback is welcome!
>>>
>>> I fail to see a use case.
>> In the section "Typical use" (by the link), two use case examples are shown.
>
> Those are examples for compiler extensions.
>
>>> IMO the inner mechanisms of compilers shouldn't be cemented
>>> by so-called standards.
>> The proposed API cements exactly zero inner mechanisms of compilers.
>
> I don't think so. Many Forths have LAST which isn't standardized either.
They continue to use their LAST or whatever they used before.
> Ruvim schrieb am Montag, 23. Oktober 2023 um 22:49:04 UTC+2:
>> On 2023-10-23 20:03, minforth wrote:
>>> Ruvim schrieb am Montag, 23. Oktober 2023 um 16:25:00 UTC+2:
>>>> I prepared a proposal: New words: latest-name and latest-name-in [1]
>>>>
>>>> In a nutshell:
>>>>
>>>> LATEST-NAME-IN ( wid -- nt|0 )
>>>> Remove the word list identifier wid from the stack. If this word list is
>>>> empty, then return 0, otherwise return the name token nt for the
>>>> definition that was placed most recently into this word list.
>>>>
>>>> LATEST-NAME ( -- nt )
>>>> Return the name token nt for the definition that was placed most
>>>> recently into the compilation word list, if such definition exists.
>>>> Otherwise throw exception code -80.
>>>>
>>>> Feedback is welcome!
>>>
>>> I fail to see a use case.
>> In the section "Typical use" (by the link), two use case examples are shown.
>
> Those are examples for compiler extensions.
>
>>> IMO the inner mechanisms of compilers shouldn't be cemented
>>> by so-called standards.
>> The proposed API cements exactly zero inner mechanisms of compilers.
>
> I don't think so. Many Forths have LAST which isn't standardized either.
The proposed words are intended for *programs*. The system is not
required to use these words at all.
Even if the system provides these words, this does not in any way limit
the internal mechanisms of its compiler.
>> The only additional burden is to store the latest word in the word list
>> structure. But anyway, almost all Forth systems do it. If not — the
>> system is free to not provide this API.
>
> Perhaps a new wordset COMPILER-EXTENSION would be better.
> Also as a good place for recognizers, whenever that proposal makes it.
the Forth text interpreter via Recognizer API (and even use it for its
own purposes).
But the words LATEST-NAME-IN and LATEST-NAME simply provide some
information from word lists, like the words FIND-NAME-IN or
TRAVERSE-WORDLIST do.
--
Ruvim
none albert
Oct 24, 2023, 9:30:22 AM10/24/23
to
In article <uh89cq$3rfe1$2...@dont-email.me>,
Ruvim <ruvim...@gmail.com> wrote:
<SNIP>
>
>But your implementation is too system specific — it requires a
>capability to change behavior of any word.
What can I say.
The python people can do it. ciforth can do it. gdb can do it.
It is no excuse if a system is not powerful enough.
Ruvim <ruvim...@gmail.com> wrote:
<SNIP>
>> The use case of `decorated is to add temporary debug
>> information to a complicated system, especially if
>> Heisenbugs prevent you to insert debugging code.
>> information to a complicated system, especially if
>> Heisenbugs prevent you to insert debugging code.
>The idea of a special syntax for decoration is that you don't need to
>repeat the name of the word that is decorated.
>
>Otherwise it's just a wrapper, which can be always implemented directly.
So I have this answered beforehand. It doesn't help with a Heisenbug.
>repeat the name of the word that is decorated.
>
>Otherwise it's just a wrapper, which can be always implemented directly.
>
>But your implementation is too system specific — it requires a
>capability to change behavior of any word.
The python people can do it. ciforth can do it. gdb can do it.
It is no excuse if a system is not powerful enough.
Ruvim
Oct 24, 2023, 3:15:36 PM10/24/23
to
On 2023-10-24 08:37, albert wrote:
> In article <uh63vl$37cua$1...@dont-email.me>,
> Ruvim <ruvim...@gmail.com> wrote:
>> On 2023-10-23 15:04, albert wrote:
>>> In article <uh5vno$36el4$1...@dont-email.me>,
>>> Ruvim <ruvim...@gmail.com> wrote:
>>>> I prepared a proposal: New words: latest-name and latest-name-in [1]
>>>>
>>>> In a nutshell:
>>>>
>>>> LATEST-NAME-IN ( wid -- nt|0 )
>>>> Remove the word list identifier wid from the stack. If this word list is
>>>> empty, then return 0, otherwise return the name token nt for the
>>>> definition that was placed most recently into this word list.
>>>>
>>>> LATEST-NAME ( -- nt )
>>>> Return the name token nt for the definition that was placed most
>>>> recently into the compilation word list, if such definition exists.
>>>> Otherwise throw exception code -80.
>>>>
>>>> Feedback is welcome!
>>>
>>> I hate to see NAME here. I advocate dea (dictionary entry address)
>>> since 1993 , working on the transputer Forth with Marcel Hendrix.
>>> There were N fields and N^2 transformation and I have had
>>> enough of it.
>>
>> "DEA" is an acronym. It's better to use a full English word if appropriate.
>
> This a slight disadvantage. However it conflicts with nothing.
I'm not against the term "DEA". It could be acceptable.
> In article <uh63vl$37cua$1...@dont-email.me>,
> Ruvim <ruvim...@gmail.com> wrote:
>> On 2023-10-23 15:04, albert wrote:
>>> In article <uh5vno$36el4$1...@dont-email.me>,
>>> Ruvim <ruvim...@gmail.com> wrote:
>>>> I prepared a proposal: New words: latest-name and latest-name-in [1]
>>>>
>>>> In a nutshell:
>>>>
>>>> LATEST-NAME-IN ( wid -- nt|0 )
>>>> Remove the word list identifier wid from the stack. If this word list is
>>>> empty, then return 0, otherwise return the name token nt for the
>>>> definition that was placed most recently into this word list.
>>>>
>>>> LATEST-NAME ( -- nt )
>>>> Return the name token nt for the definition that was placed most
>>>> recently into the compilation word list, if such definition exists.
>>>> Otherwise throw exception code -80.
>>>>
>>>> Feedback is welcome!
>>>
>>> I hate to see NAME here. I advocate dea (dictionary entry address)
>>> since 1993 , working on the transputer Forth with Marcel Hendrix.
>>> There were N fields and N^2 transformation and I have had
>>> enough of it.
>>
>> "DEA" is an acronym. It's better to use a full English word if appropriate.
>
> This a slight disadvantage. However it conflicts with nothing.
But at the moment, the term "name token" is already established, as well
as its designation "name" in the names of words.
What is wrong with that? Why is it worth changing to "dea"?
> There are Forth names that are abbreviations:
> R/O R/W SCR TIB SM/REM UM/MOD
> In the 30 years I have used DEA nobody has come up that catches the
> concept properly, and certainly anybody who has come up with a name that
> catches the concept improperly have found that is subject to confusion and
> infighting. On the other hand *nobody* has used "dea" in a conflicting
> way.
>
> "
> The DEA of a word identifies the word internally. It should be
> possible for the system to find all the properies of word
> knowing its DEA. In particular the executable code and its
> name (if it has a name)
> " ^^^^^^^^^^^^^^^^
>
> It bears repeating:
>
> ***********************************************************
> * Names are SO not determining the identity of a word. *
> ***********************************************************
A name token identifies the word, by its definition:
A name token is a single-cell value that identifies a named Forth
definition.
In this context the term "token" does not mean a character sequence.
In a general sense, it is "something serving as an expression of
something else" -- https://en.wiktionary.org/wiki/token#Noun
>>
>> "NAME" has a long history. It denoted NFA, and now it denotes a name
>> token, which is successor of NFA — in all words except "PARSE-NAME", for
>> example "FIND-NAME", "FIND-NAME-IN", "NAME>COMPILE", etc.
>>
>> There is no point in replacing "NAME" in all these words.
>> At the same time, naming for new words must be in consistence with
>> existing words.
> That is a non sequitur. In particular FIND-NAME is an example why
> the string NAME is a separate concept of the dea.
string. And it's a thing that is found.
If I understand right, in English, "to find x" means that "x" is the
thing that is found on success. In this case the found thing is a name
token, that is denoted as "NAME".
> Compare :
> FOUND ( sc -- dea )
> Look up the sc (addr len) in the current search order.
> Return *the* address dea, the address that rules them all.
For example, in some plausible Forth system it can be an index in the
array of headers.
>>
>> [...]
>>>
>>> ***********************************************************
>>> * Names are SO not determining the identity of a word. *
>>> ***********************************************************
>>>
>>> I'm not against your proposal, only the names are wrong.
>>>
>>> >LATEST ( wid -- dea|0 )
>>> LATEST ( -- dea )
>>
>> The first name is not consistent with other similar names.
>>
>> And words with the second name already exist in many Forth systems, and
>> they behavior varies.
>
> Seriously? What with S>D >R U> EKEY>CHAR
But I would prefer to avoid new standard words with names starting with
">", if this word is not for a stack related word.
> You are trying to win a debate here at any price. That doesnot get you
> points in a standard commission that must compromise.
> It is not a fraternety debate club.
not suitable for this ;)
I just wonder, what a compromise do you have in mind in this particular
case? I mean, a compromise between which positions?
>>>> [1]
>>>> https://forth-standard.org/proposals/new-words-latest-name-and-latest-name-in?hideDiff#reply-1124
>>>> Ruvim
>>>
>>> Groetjes Albert
>>>
>>> P.S. I use LATEST all over the place. I have a hard time to imagine
>>> a use for >LATEST. Unless ..
>>>
>>> Only define >LATEST. LATEST might be controversial so you avoid
>>> standardising it.
>>> On the top of the file you then can say
>>> : LATEST CURRENT @ >LATEST ;
>>
>> It's will be slightly longer.
>> In my proposal this word never returns 0, but throws an exception instead.
>>
>>> And get it over with.
>>> Same situation as with
>>> : NOT 0= ;
>
> I can't getting the point accross.
> The problem with LATEST that the obvious solution doesn't work.
> The naive solution reading iso93 is returning an xt.
> So what thingy is LATEST to return?
LATEST is related to my proposal.
--
Ruvim
none albert
Oct 24, 2023, 3:40:51 PM10/24/23
to
In article <uh954j$4q87$1...@dont-email.me>, Ruvim <ruvim...@gmail.com> wrote:
>On 2023-10-24 08:37, albert wrote:
>> It bears repeating:
>>
>> ***********************************************************
>> * Names are SO not determining the identity of a word. *
>> ***********************************************************
>
>I agree. A word name does not identify the word.
>A name token identifies the word, by its definition:
>
> A name token is a single-cell value that identifies a named Forth
>definition.
Almost correct.
>On 2023-10-24 08:37, albert wrote:
>> It bears repeating:
>>
>> ***********************************************************
>> * Names are SO not determining the identity of a word. *
>> ***********************************************************
>
>I agree. A word name does not identify the word.
>A name token identifies the word, by its definition:
>
> A name token is a single-cell value that identifies a named Forth
>definition.
A name token is a single-cell value that identifies a Forth
definition. Note that it may not have a name.
>> I can't getting the point accross.
>> The problem with LATEST that the obvious solution doesn't work.
>> The naive solution reading iso93 is returning an xt.
>> So what thingy is LATEST to return?
>
>Sorry, I'm not following you here. I don't see how your question about
>LATEST is related to my proposal.
should be named:
Possibly answers:
A name token
B dea
In any case it must be an answer that identifies a
word/definition/you-know-what-I-mean.
minforth
Oct 24, 2023, 7:17:19 PM10/24/23
to
Anyhow IMO it needs really good arguments to increase Forth's already
overpopulated word zoo. It's more libraries we need.
But I don't want to be negative, you asked for thoughts.
dxf
Oct 24, 2023, 9:18:47 PM10/24/23
to
On 25/10/2023 10:17 am, minforth wrote:
> Ruvim schrieb am Dienstag, 24. Oktober 2023 um 13:36:11 UTC+2:
>> On 2023-10-24 06:49, minforth wrote:
>>> Perhaps a new wordset COMPILER-EXTENSION would be better.
>>> Also as a good place for recognizers, whenever that proposal makes it.
>>
>> It's true for recognizers, since a program can affect the behavior of
>> the Forth text interpreter via Recognizer API (and even use it for its
>> own purposes).
>>
>> But the words LATEST-NAME-IN and LATEST-NAME simply provide some
>> information from word lists, like the words FIND-NAME-IN or
>> TRAVERSE-WORDLIST do.
>
> FIND-NAME-IN is exotic but I can guess... ;-)
>
> Anyhow IMO it needs really good arguments to increase Forth's already
> overpopulated word zoo.
Compiler extension is what 200x is mostly interested in.
> Ruvim schrieb am Dienstag, 24. Oktober 2023 um 13:36:11 UTC+2:
>> On 2023-10-24 06:49, minforth wrote:
>>> Perhaps a new wordset COMPILER-EXTENSION would be better.
>>> Also as a good place for recognizers, whenever that proposal makes it.
>>
>> It's true for recognizers, since a program can affect the behavior of
>> the Forth text interpreter via Recognizer API (and even use it for its
>> own purposes).
>>
>> But the words LATEST-NAME-IN and LATEST-NAME simply provide some
>> information from word lists, like the words FIND-NAME-IN or
>> TRAVERSE-WORDLIST do.
>
> FIND-NAME-IN is exotic but I can guess... ;-)
>
> Anyhow IMO it needs really good arguments to increase Forth's already
> overpopulated word zoo.
> It's more libraries we need.
with the same enthusiasm as was Hugh's and those before him. I put great
value on the libraries I include with DX-Forth. Other users very little.
Perhaps they need to find their own path - just as I did.
S Jack
Oct 24, 2023, 10:37:09 PM10/24/23
to
On Tuesday, October 24, 2023 at 2:40:51 PM UTC-5, none albert wrote:
> >> It bears repeating:
> >>
> >> ***********************************************************
> >> * Names are SO not determining the identity of a word. *
> >> ***********************************************************
>
> >> It bears repeating:
> >>
> >> ***********************************************************
> >> * Names are SO not determining the identity of a word. *
> >> ***********************************************************
>
> A name token is a single-cell value that identifies a Forth
> definition. Note that it may not have a name.
Two ideas that appeal to me (and likely only me) are:
> definition. Note that it may not have a name.
1. Have standard behaviors, but not names. Users free to
assign whatever names that fit the context where the
behavior is used. COUNT and C@++ in my source have the
same behavior; which get used depends on the context where
applied. Your FOO with behavior xt:666 can be my BAR ; just
map if exchange of source code is desired.
2. Like postscript in general define words anonymously. Assign
name only if the behavior needs to persist.
Just mentioning this as Albert seems to have some leanings in
this direction.
--
me
minforth
Oct 25, 2023, 2:39:02 AM10/25/23
to
dxf schrieb am Mittwoch, 25. Oktober 2023 um 03:18:47 UTC+2:
> On 25/10/2023 10:17 am, minforth wrote:
> > It's more libraries we need.
> Apparently not but feel free to provide them.
There is no standard API for any standard Forth system.
> On 25/10/2023 10:17 am, minforth wrote:
> > It's more libraries we need.
> Apparently not but feel free to provide them.
Other good guys test their code snippets against a number of
popular free Forth compilers, write wrappers, and provide
missing words.
I must be a lazy bad guy. :-)
Ruvim
Oct 25, 2023, 9:11:51 AM10/25/23
to
On 2023-10-24 23:17, minforth wrote:
> Ruvim schrieb am Dienstag, 24. Oktober 2023 um 13:36:11 UTC+2:
>> On 2023-10-24 06:49, minforth wrote:
>>> Perhaps a new wordset COMPILER-EXTENSION would be better.
>>> Also as a good place for recognizers, whenever that proposal makes it.
>>
>> It's true for recognizers, since a program can affect the behavior of
>> the Forth text interpreter via Recognizer API (and even use it for its
>> own purposes).
>>
>> But the words LATEST-NAME-IN and LATEST-NAME simply provide some
>> information from word lists, like the words FIND-NAME-IN or
>> TRAVERSE-WORDLIST do.
>
> FIND-NAME-IN is exotic but I can guess... ;-)
Can you suggest something better? ))
> Ruvim schrieb am Dienstag, 24. Oktober 2023 um 13:36:11 UTC+2:
>> On 2023-10-24 06:49, minforth wrote:
>>> Perhaps a new wordset COMPILER-EXTENSION would be better.
>>> Also as a good place for recognizers, whenever that proposal makes it.
>>
>> It's true for recognizers, since a program can affect the behavior of
>> the Forth text interpreter via Recognizer API (and even use it for its
>> own purposes).
>>
>> But the words LATEST-NAME-IN and LATEST-NAME simply provide some
>> information from word lists, like the words FIND-NAME-IN or
>> TRAVERSE-WORDLIST do.
>
> FIND-NAME-IN is exotic but I can guess... ;-)
It's a part of the Forth "living" standard already.
> Anyhow IMO it needs really good arguments to increase Forth's already
> overpopulated word zoo.
> It's more libraries we need.
Using third party libraries in Forth is a pain, especially if you want
to do it regardless of a particular Forth system.
I have an idea of a core library that extends "include" and "require" to
allow them understanding URIs and load+cache files via the Internet on
the fly.
If the used Forth system does not provide the required capabilities, the
user can use another Forth system to just cache all libraries, and then
use the first one (without changing any source codes).
When this library exists, a more advanced package manager (and module
manager) can be developed on the top of this library.
Well we have https://theforth.net/package/f
But this package manager is tied to a single repository and requires too
much manual work.
> But I don't want to be negative, you asked for thoughts.
Ruvim
Ruvim
Oct 25, 2023, 9:30:41 AM10/25/23
to
On 2023-10-24 19:40, albert wrote:
> In article <uh954j$4q87$1...@dont-email.me>, Ruvim <ruvim...@gmail.com> wrote:
>> On 2023-10-24 08:37, albert wrote:
>>> It bears repeating:
>>>
>>> ***********************************************************
>>> * Names are SO not determining the identity of a word. *
>>> ***********************************************************
>>
>> I agree. A word name does not identify the word.
>> A name token identifies the word, by its definition:
>>
>> A name token is a single-cell value that identifies a named Forth
>> definition.
>
> Almost correct.
>
> A name token is a single-cell value that identifies a Forth
> definition. Note that it may not have a name.
It depends on how we define what nameless Forth definition is (i.e., a
> In article <uh954j$4q87$1...@dont-email.me>, Ruvim <ruvim...@gmail.com> wrote:
>> On 2023-10-24 08:37, albert wrote:
>>> It bears repeating:
>>>
>>> ***********************************************************
>>> * Names are SO not determining the identity of a word. *
>>> ***********************************************************
>>
>> I agree. A word name does not identify the word.
>> A name token identifies the word, by its definition:
>>
>> A name token is a single-cell value that identifies a named Forth
>> definition.
>
> Almost correct.
>
> A name token is a single-cell value that identifies a Forth
> definition. Note that it may not have a name.
Forth definition without a name).
I could consider:
A nameless Forth definition is a Forth definition for which the
standard does not require the system to provide a name token.
An example:
:noname 123 . ; ( xt )
For this definition, we only have an execution token. It's unable to
obtain a name token. Then we can say that this definition is a nameless
Forth definition.
>>> I can't getting the point accross.
>>> The problem with LATEST that the obvious solution doesn't work.
>>> The naive solution reading iso93 is returning an xt.
>>> So what thingy is LATEST to return?
>>
>> Sorry, I'm not following you here. I don't see how your question about
>> LATEST is related to my proposal.
>
> The answer is not what it is that is returned. The answer is how it
> should be named:
> Possibly answers:
> A name token
> B dea
What do you have against this term?
>
> In any case it must be an answer that identifies a
> word/definition/you-know-what-I-mean.
>
Ruvim
0 new messages